Constraint-Based Query Optimization and Processing
نویسندگان
چکیده
Constraint technology can be used to extend the functionality and performance of current database systems in a variety of ways. In this paper, we show how to use constraints for the processing of queries that contain user-deened functions. Such functions are a common feature in many extended and object-oriented database applications. By representing knowledge about the functions through constraints, the eeciency of query optimization and execution can be improved signiicantly. We demonstrate the potential of our technique on several examples from spatial data management.
منابع مشابه
Constraint-Based Query Evaluation in Deductive Databases
Constraints play an important role in the efficient query evaluation in deductive databases. In this paper, constraint-based query evaluation in deductive databases is investigated, with the emphasis on linear recursions with function symbols. Constraints are classified into three classes: (i) rule constraints, (ii) integrity constraints, and (iii) query constraints. Techniques are developed fo...
متن کاملView-based Query Processing for Semistructured Data
View-based query processing is the problem of processing queries over a database based on a set of materialized views, rather than on the raw data in the database. It is a fundamental problem in several settings, such as data warehousing, mobile computing, query optimization, and data integration, and comes about in different forms. The basic task is view-based query answering, which amounts to...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملView-Based Query Processing and Constraint Satisfaction
View-based query processing requires to answer a query posed to a database only on the basis of the information on a set of views, which are again queries over the same database. This problem is relevant in many aspects of database management, and has been addressed by means of two basic approaches, namely, query rewriting and query answering. In the former approach, one tries to compute a rewr...
متن کاملAlgorithms for Querying by Spatial Structure
Structural queries constitute a special form of content-based retrieval where the user specifies a set of spatial constraints among query variables and asks for all configurations of actual objects that (totally or partially) match these constraints. Processing such queries can be thought of as a general form of spatial joins, i.e., instead of pairs, the result consists of n-tuples of objects, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995